Ring embedding in faulty honeycomb rectangular torus
نویسندگان
چکیده
Assume that m and n are positive even integers with n 4. The honeycomb rectangular torus HReT(m,n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m,n) is a 3-regular bipartite graph. We prove that any HReT(m,n) − e is hamiltonian for any edge e ∈ E(HReT(m,n)). Moreover, any HReT(m,n)− F is hamiltonian for any F = {a, b} with a ∈A and b ∈ B where A and B are the bipartition of HReT(m,n), if n 6 or m= 2. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Generalized honeycomb torus is Hamiltonian
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a “token ring” parallel algorithm onto the associated network in an efficient way. Cho and Hsu...
متن کاملEmbedding of rings in 2-D meshes and tori with faulty nodes
To increase the reliability of networks embedded in meshes or tori and to allow their use in the presence of faulty nodes, efficient fault-tolerant schemes in meshes and tori are necessary. In this paper, we present algorithms for embedding a ring in a mesh-type and torus-type multiprocessor networks in the event of node failures. In our approach, a mesh or torus is partitioned into 4 4 submesh...
متن کاملOne-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peterson-Torus graph algorithm in regard to the continuity with honeycomb-mesh algorithm in order to apply the algorithm to sensor networks. Once a new i...
متن کاملDistributed Fault-Tolerant Embedding of Several Topologies in Hypercubes
Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is mapped onto the topology of multiprocessor structures so that the corresponding application can be executed. To increase the reliability of parallel applications, fault-tolerant embedding is necessary. In this paper, w...
متن کاملThe globally Bi-3*-connected property of the honeycomb rectangular torus
The honeycomb rectangular torus is an attractive alternative to existing networks such as mesh-connected networks in parallel and distributed applications because of its low network cost and well-structured connectivity. Assume that m and n are positive even integers with n P 4. It is known that every honeycomb rectangular torus HReTðm; nÞ is a 3-regular bipartite graph. We prove that in any HR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 84 شماره
صفحات -
تاریخ انتشار 2002